Contribution of Channel Equivocation for the Development of Source Coding Theorems
نویسندگان
چکیده
The present communication deals with the development of new coding theorems in terms of channel equivocation, that is, coding is done for a source which selects a new set of source statistics after each output symbol is received from the channel. New proof for Fano’s bound on Shannon’s equivocation is provided by using log sum inequality. Moreover, bounds on various generalizations of Shannon’s equivocation have been provided. AMS Subject Classification: 94A24, 94A15, 94A29
منابع مشابه
Achievable Secrecy Rate Regions of State Dependent Causal Cognitive Interference Channel
In this paper, the secrecy problem in the state dependent causal cognitive interference channel is studied. The channel state is non-causally known at the cognitive encoder. The message of the cognitive encoder must be kept secret from the primary receiver. We use a coding scheme which is a combination of compress-and-forward strategy with Marton coding, Gel’fand-Pinsker coding and Wyner’s wire...
متن کاملEquivocations, Exponents and Second-Order Coding Rates under Various Rényi Information Measures
In this paper, we evaluate the asymptotics of equivocations, their exponents as well as their second-order coding rates under various Rényi information measures. Specifically, we consider the effect of applying a hash function on a source and we quantify the level of non-uniformity and dependence of the compressed source from another correlated source when the number of copies of the sources is...
متن کاملConverse Coding Theorems for Quantums Source and Noisy Channel
We prove the weak converse coding theorems for the quantum source and channel. Our results give the lower bound for capacity of source and the upper bounds for capacity of channel. We also prove the monotonicity of mutual quantum information in general case.
متن کاملSecrecy Communication with Security Rate Measure
We introduce a new measure on secrecy, which is established based on rate-distortion theory. It is named security rate, which is the minimum (infimum) of the additional rate needed to reconstruct the source within target distortion level with any positive probability for wiretapper. It denotes the minimum distance in information metric (bits) from what wiretapper has received to any decrypted r...
متن کاملua nt - p h / 97 02 03 4 v 2 2 1 M ay 1 99 7 Converse coding theorems for quantum source and noisy channel
The weak converse coding theorems have been proved for the quantum source and channel. The results give the lower bound for capacity of source and the upper bound for capacity of channel. The monotonicity of mutual quantum information have also been proved.
متن کامل